All 2-planar graphs having the same spanning subgraph

A graph drawn on the plane is 2-immersed in if each edge crossed by at most two other edges (this drawing of called a 2-immersion plane). 2-planar it can be plane. We consider class T all finite planar graphs triangulating such that have no loops and multiple edges, vertices degree 5 6 only, distance between any 5-valent least 4. describe possible 2-immersions for 2-immersions, we ways which new added to obtain graph.